2 research outputs found
On the Ramsey number of 4-cycle versus wheel
For any fixed graphs and , the Ramsey number is the smallest positive integer such that for every graph on vertices must contain or the complement of contains . The girth of graph is a length of the shortest cycle. A -regular graph with the girth is called a -graph. If the number of of vertices in -graph is minimized then we call this graph a -cage. In this paper, we derive the bounds of Ramsey number for some values of . By modifying -graphs, for or , we construct these corresponding -good graphs. </div